Polynomial algorithms for estimating network reliability
نویسندگان
چکیده
منابع مشابه
Sequential Importance Sampling Algorithms for Estimating the All-Terminal Reliability Polynomial of Sparse Graphs
The all-terminal reliability polynomial of a graph counts its connected subgraphs of various sizes. Algorithms based on sequential importance sampling (SIS) have been proposed to estimate a graph’s reliability polynomial. We show upper bounds on the relative error of three sequential importance sampling algorithms. We use these to create a hybrid algorithm, which selects the best SIS algorithm ...
متن کاملPolynomial dual network simplex algorithms
The transshipment problem is one of the central problems in network optimization. There exist several polynomial and strongly polynomial algorithms for solving this problem (see the surveys [7, 1]). Nevertheless, the method of choice in practice still seems to be the network simplex method. In this paper we shall consider the dual network simplex method. We show that some excess scaling algorit...
متن کاملA Unified Approach for Design of Lp Polynomial Algorithms
By summarizing Khachiyan's algorithm and Karmarkar's algorithm forlinear program (LP) a unified methodology for the design of polynomial-time algorithms for LP is presented in this paper. A key concept is the so-called extended binary search (EBS) algorithm introduced by the author. It is used as a unified model to analyze the complexities of the existing modem LP algorithms and possibly, help ...
متن کاملEstimating the Reliability of Neural Network Classifications
A method for quantifying the reliability of object classiica-tions using trained neural networks is given. Using this method one is able to give an estimation of a conndence value for a certain object. This reveals how trustworthy the classiication of the particular object by the neural pattern classiier is. Even for badly trained networks it is possible to give reliable conndence estimations. ...
متن کاملA Recursive Variance Reduction Algorithm for Estimating Communication Network Reliability
In order to evaluate the capacity of a communication network architecture to resist to the possible faults of some of its components, several (un)reliability metrics are currently used. In this paper, we consider the K-terminal (un)reliability measure. The exact evaluation of this parameter is NP{hard problem. An alternative approach is to perform estimations using Monte Carlo simulation method...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 1982
ISSN: 0028-3045,1097-0037
DOI: 10.1002/net.3230120408